Route Planning in Vanet By Comparitive Study of Algoriths

Route planning techniques is one of the main tasks of VRP (Vehicles route planning) which aims to find an optimal route from a starting point to a destination. Various techniques have been proposed so far to calculate shortest path in VANET by different researchers. This paper presents a study about the two well-known shortest path searching algorithms, which are used in routing. They are Bellman-Ford algorithm and Dijkstra algorithm. They were compared on the basis of their run time. The analysis of the comparison is given briefly to calculate the best available path which reduces the problem of delay. Calculating best shortest path gives useful information to registered users to travel on best available path. In this research work is done to evaluate the performance of proposed algorithms. The results of algorithm are compared to travel on best available path. KeywordsVehicular Ad-Hoc network, Connection Availability, algorithms, Performance Evaluation, Route Planning